Largest component in random combinatorial structures
نویسندگان
چکیده
منابع مشابه
Regeneration in random combinatorial structures
Theory of Kingman’s partition structures has two culminating points • the general paintbox representation, relating finite partitions to hypothetical infinite populations via a natural sampling procedure, • a central example of the theory: the Ewens-Pitman two-parameter partitions. In these notes we further develop the theory by • passing to structures enriched by the order on the collection of...
متن کاملThe Largest Component in Subcritical Inhomogeneous Random Graphs
as was introduced by Bollobás, Janson and Riordan in [1]. Here S is a separable metric space and μ is a Borel probability measure on S . No relationship is assumed between x (n) i and x (n′) i . To simplify notation we shall from now on write (x1, . . . , xn) = (x (n) 1 , . . . , x (n) n ). We begin by recalling some basic definitions and assumptions from [1]. For each n let (x1, . . . , xn) be...
متن کامل4 Random combinatorial structures : the convergent case
This paper studies the distribution of the component spectrum of combinatorial structures such as uniform random forests, in which the classical generating function for the numbers of (irreducible) elements of the different sizes converges at the radius of convergence; here, this property is expressed in terms of the expectations of independent random variables Zj , j ≥ 1, whose joint distribut...
متن کاملRandom combinatorial structures: the convergent case
This paper studies the distribution of the component spectrum of combinatorial structures such as uniform random forests, in which the classical generating function for the numbers of (irreducible) elements of the different sizes converges at the radius of convergence; here, this property is expressed in terms of the expectations of independent random variables Zj , j ≥ 1, whose joint distribut...
متن کاملIndependent Process Approximations for Random Combinatorial Structures
Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to compare the combinatorial structure directly to the independent discrete process, without renormalizing. The quality of approximation can often be convenient...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1998
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00115-5